A unified approach to network survivability for teletraffic networks: models, algorithms and analysis

نویسنده

  • Deep Medhi
چکیده

| In this paper, we address the problem of network survivability by presenting a uniied approach where the wide-area circuit-switched teletraac network and the underlying transmission facility network are considered simultaneously. We assume the backbone circuit-switched teletraac network to be nonhierarchical with dynamic call routing capabilities. The transmission facility network is considered to be sparse (as is observed for emerging ber optic networks) and is assumed to be two-arc connected. Our approach addresses the network survivability objective by considering two grade-of-service parameters: one for the traac network under normal operating condition and the other for aaected part of the network under a network failure. We present uniied mathematical models and develop heuristic algorithms. We then present computational results to demonstrate the eeectiveness of the uniied approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks

In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...

متن کامل

Efficiency evaluation of wheat farming: a network data envelopment analysis approach

Traditional data envelopment analysis (DEA) models deal with measurement of relative efficiency of decision making units (DMUs) in which multiple-inputs consumed to produce multiple-outputs. One of the drawbacks of these models is neglecting internal processes of each system, which may have intermediate products and/or independent inputs and/or outputs. In this paper some methods which are usab...

متن کامل

Optimal Coding Subgraph Selection under Survivability Constraint

Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...

متن کامل

A Unified Approach to Survivability of Connection-Oriented Networks

This paper deals with problems of computer networks survivability. We present and discuss survivability aspects of Content Delivery Networks (CDNs) and other services based on the anycast paradigm. After that, we propose a new unified approach to network survivability. This approach assumes using jointly survivability mechanisms for both kinds of traffic: anycast (oneto-one-of-many access to co...

متن کامل

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1994